Move raises problems

4-move perfect ZKIP for some promise problems

In this paper, we consider ZKIPs for promise problems. A promise problem is a pair of predicates (Q;R). A Turning machine T solves the promise problem (Q;R) if, for every x satisfying Q(x), machine T halts and it answers \yes" i R(x). When :Q(x), we do not care what T does. First, we de ne \promised BPP" which is a promise problem version of BPP. Then, we prove that a promise problem (Q;R) has ...

A Chess Composer of Two-Move Mate Problems

Computerized chess composers of mate problems are rare. Moreover, so far they do not produce either impressive or creative new mate problems. In this paper, we describe a model called CHESS COMPOSER. This model uses a 64-bit representation, an ordered version of Iterative-Deepening DepthFirst Search, and a quality function built with the help of two international masters in chess-problem compos...

Efficient Move Evaluations for Time-Dependent Vehicle Routing Problems

In this paper we introduce several new methods for efficiently evaluating moves in neighborhood search heuristics for routing problems with time-dependent travel times. We consider both the case that route duration is constrained and the case that route duration appears in the objective. We observe that the composition of piecewise linear functions can be evaluated in various orders when comput...

A Deep Improver of Two-move Chess Mate Problems

A Robust Technique to Recognize Objects in Images, and the DB Problems it Raises

In the context of content-based image retrieval from large databases, traditional systems typically compute a single descriptor per image based for example on color histograms. The result of a query is in general the images whose descriptors are the closest to the descriptor of the query image. Systems built this way are able to return images that are globally similar to the query image, but ca...